Matrix and matricial iteration theories, Part II
نویسندگان
چکیده
منابع مشابه
The iteration of cubic polynomials Part II: patterns and parapatterns
2. PAYrERNS ........................... 235 Topological preliminaries .................... 235 C o n s t r u c t i n g the t ree o f p a t t e r n s . . . . . . . . . . . . . . . . 237 T he po ten t i a l func t ion hR . . . . . . . . . . . . . . . . . . . . 239 Cri t ical g raphs , annul i and a r g u m e n t s . . . . . . . . . . . . . 240 T h e t ree o f real p a t t e r n s . . . . . . . . ...
متن کاملWhat Are Iteration Theories?
We prove that iteration theories can be introduced as algebras for the monad Rat on the category of signatures assigning to every signature Σ the rationalΣ-tree signature. This supports the result that iteration theories axiomatize precisely the equational properties of least fixed points in domain theory: Rat is the monad of free rational theories and every free rational theory has a continuou...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملIteration theories as monadic algebras
Iteration theories, as introduced by Stephen Bloom and Zoltán Ésik, are Lawvere theories equipped with a function assigning to every morphism e : n → n + k (representing a system of n recursive equations whose left-hand sides are variables and right-hand sides are terms in those n variables and k parameters) a morphism e† : n → k (representing a solution of those equations). This function is re...
متن کاملKleene Algebra with Products and Iteration Theories
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90011-k